Continuous materials requirements planning (CMRP) approach when order type is lot for lot and safety stock is zero and its applications

نویسنده

  • Ramin Sadeghian
چکیده

The materials requirements planning (MRP) approach, applied in production planning and management has some weaknesses. One of those is the discreteness of time so called time periods in this approach which makes it impossible to order the requirements at irregular time moments or periods. In this paper, a new form of MRP, named as continuous materials requirements planning (CMRP) approach, is introduced. Moreover, the priorities and advantages of this approach over the discrete MRP (DMRP) one are further discussed and the conditions and manner of CMPR application in different types of problems are analyzed. The CMRP system, introduced in this paper does not have any safety stock (SS) and its order type (OT) is lot for lot (L4L). For applying this system, several algorithms and lemmas along with their proofs are also described. Also two numerical examples with one real case study are presented. © 2011 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to Use MRP in Continuous Production Industries When Order Type is Lot for Lot

The Materials Requirements Planning (MRP) method that is applied in production planning and management has some weaknesses. One of its weaknesses is that the time in MRP method is discrete, and is considered as time period. Hence we are not able to order our requirements at irregular time moments or periods. In this paper, a new form of MRP is introduced that is named Continuous Materials Requi...

متن کامل

A Multi-level Capacitated Lot-sizing Problem with Safety Stock Deficit and Production Manners: A Revised Simulated Annealing

[1] Corresponding author e-mail: [email protected]   [1] Corresponding author e-mail: [email protected]   Lot-sizing problems (LSPs) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. This paper aims at developing a new mathematical model for the multi-level ca...

متن کامل

The Finite Horizon Economic Lot Scheduling in Flexible Flow Lines

This paper addresses the common cycle multi-product lot-scheduling problem in flexible flow lines (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unite while satisfying the demands without backlogging. This problem consists of a combi...

متن کامل

A Basic Period Approach for Solving the Economic Lot and Delivery Scheduling in Flexible Flow Lines

In this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. Single supplier via a flexible flow line production system (FFL), produces several items and delivers them directly to an assembly facility. Based on basic period (BP) strategy, a new mixed zero-one nonlinear programming model has been develop...

متن کامل

The Simultaneous Effect of Holding Safety Stock and Purchasing Policies on the Economic Production Quantity Model Subject to Random Machine Breakdown

In this paper, we develop an economic production quantity (EPQ) model under machine breakdown and two types of repair (corrective and preventive). also, study the simultaneous effect of holding safety stock and purchasing policy. In order to avoid shortages occurring as a result of the random repair time, in addition to keep safety stock, we suppose that the manufacturer could purchase some qua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Appl. Soft Comput.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2011